Rely-Guarantee Based Reasoning for Message-Passing Programs
نویسندگان
چکیده
منابع مشابه
Rely-Guarantee Based Reasoning for Message-Passing Programs
The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular a...
متن کاملRely-Guarantee Based Reasoning for Message-Passing Programs1
The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying interthread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular an...
متن کاملRely/Guarantee Reasoning for Asynchronous Programs
Asynchronous programming has become ubiquitous in smartphone and web application development, as well as in the development of server-side and system applications. Many of the uses of asynchrony can be modeled by extending programming languages with asynchronous procedure calls—procedures not executed immediately, but stored and selected for execution at a later point by a non-deterministic sch...
متن کاملOn Rely-Guarantee Reasoning
Many semantic models of rely-guarantee have been proposed in the literature. This paper proposes a new classification of the approaches into two groups based on their treatment of guarantee conditions. To allow a meaningful comparison, it constructs an abstract model for each group in a unified setting. The first model uses a weaker judgement and supports more general rules for atomic commands ...
متن کاملModular Reasoning for Message-Passing Programs
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verification requires better locality and modularity. Reasoning of shared memory systems has gained much progress in these aspects. However, modular verification of distributed systems is still in demand. In this paper, we propose a new reasoning system for message-passing programs. It is a novel logi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Annals of Computer Science
سال: 2014
ISSN: 2248-2695
DOI: 10.7561/sacs.2014.2.217